A Complete Axiomatic Semantics for the CSP Stable-Failures Model
نویسندگان
چکیده
Traditionally, the various semantics of the process algebra Csp are formulated in denotational style. For many Csp models, e.g., the traces model, equivalent semantics have been given in operational style. A Csp semantics in axiomatic style, however, has been considered problematic in the literature. In this paper we present a sound and complete axiomatic semantics for Csp with unbounded nondeterminism over an alphabet of arbitrary size. This result is connected in various ways with our tool Csp-Prover: (1) the Csp dialect under discussion is the input language of Csp-Prover; (2) all theorems presented have been verified with Csp-Prover; (3) CspProver implements the given axiom system.
منابع مشابه
Trace and Stable Failures Semantics for CSP-Agda
CSP-Agda is a library, which formalises the process algebra CSP in the interactive theorem prover Agda using coinductive data types. In CSP-Agda, CSP processes are in monadic form, which supports a modular development of processes. In this paper, we implement two main models of CSP, trace and stable failures semantics, in CSP-Agda, and define the corresponding refinement and equality relations....
متن کاملAn Extended cCSP with Stable Failures Semantics
Compensating CSP (cCSP) is an extension to CSP for modeling long-running transactions. It can be used to specify programs of service orchestration written in a programming language like WS-BPEL. So far, only an operational semantics and a trace semantics are given to cCSP. In this paper, we extend cCSP with more operators and define for it a stable failures semantics in order to reason about no...
متن کاملCorrectness Proofs of CSP Programs
In a research report we have proposed an axiomatic semantics for the language of communicating sequential processes (CSP: of Hoare (1978). In this paper, we use the axiomatic semantics to prove the correctness of a number of CSY programs.
متن کاملThe Timed Failures-Stability Model for CSP
We present a mathematical model which is the most abstract allowing (i) a fully compositional semantics for timed CSP and (ii) a natural abstraction map into the standard failures/divergences model of untimed CSP. We discuss the construction and properties of this model and ways in which it can be used to give semantics to CSP reflecting several implementation strategies.
متن کاملRevivals, stuckness and the hierarchy of CSP models
We give details of a new model for CSP introduced in response to work by Fournet et al [8]. This is the stable revivals model R alluded to in [22]. We provide the full semantics for CSP in this model, indicate why this is operationally congruent, and provide proofs of the full abstraction properties asserted in [22]. We study the place of R in the hierarchy of CSP models, and show how this gene...
متن کامل